Exact and approximate heuristics for the rectilinear Weber location problem with a line barrier

In this article, we propose an extension of the multi-Weber facility location problem with rectilinear-distance in presence passages over a non-horizontal line barrier. For single-facility case, develop exact heuristic based on divide-and-conquer approach that outperforms alternative heuristics available literature. The multiple facilities case is solved by means application alternate-location-allocation heuristic, characterized embedded and approximate procedures. large instances, (with polynomial time complexity) which provides near-optimal solutions short computational negligible gap. Finally, for testing purposes, use benchmark transformation main into equivalent p-median problem. Experimental results evidence efficiency validity proposed heuristics, are capable obtaining high quality within acceptable computation times.